Genetic Design of Vlsi Layouts
نویسنده
چکیده
A genetic algorithm for the physical design of VLSI chips is presented The algorithm simultane ously optimizes the placement of the cells with the total routing During the placement the detailed routing is done while the global routes are opti mized by the genetic algorithm This is just opposed to the usual serial ap proach where the computation of the detailed routing is the last step in the layout design
منابع مشابه
Fast Continuous Haar and Fourier Transforms of Rectilinear Polygons from VLSI Layouts
We develop the pruned continuous Haar transform and the fast continuous Fourier series, two fast and efficient algorithms for rectilinear polygons. Rectilinear polygons are used in VLSI processes to describe design and mask layouts of integrated circuits. The Fourier representation is at the heart of many of these processes and the Haar transform is expected to play a major role in techniques e...
متن کاملPruned Continuous Haar Transform of 2D Polygonal Patterns with Application to VLSI Layouts
We introduce an algorithm for the efficient computation of the continuous Haar transform of 2D patterns that can be described by polygons. These patterns are ubiquitous in VLSI processes where they are used to describe design and mask layouts. There, speed is of paramount importance due to the magnitude of the problems to be solved and hence very fast algorithms are needed. We show that by tech...
متن کاملAutomatic layout of variable-content print data
print layout, paste-up, floorplanning, genetic algorithm, self-organising documents, BICAS The increasing quantity of data held by organizations about individuals, and the recent development of digital press capable of one-off printing at a quality rivalling offset machines, have created a demand for a method to automatically generate page layouts. The present solutions to this are either to us...
متن کاملA Procedural Method for the Efficient Implementation of Full-Custom VLSI Designs
An imbedded language system for the hyout of VLSI circuits is examined. It is shown that through the judicious use of this system, a large variety of circuits can be designed with circuit density and performance comparable to traditional full-custom design methods, but with design costs more comparable to semi-custom design methods, The high performance of this methodology is attributable to th...
متن کاملHybrid genetic algorithms for constrained placement problems
Genetic algorithms have proven to be a wellsuited technique for solving selected combinatorial optimization problems. When solving real-world problems, often the main task is to find a proper representation for the candidate solutions. Strings of elementary data types with standard genetic operators may tend to create infeasible individuals during the search because of the discrete and often co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995